Affine-Distance symmetry sets
نویسندگان
چکیده
منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملAffine Distance-transitive Groups
A fruitful way of studying groups is by means of their actions on graphs. A very special and interesting class of groups are the ones acting distance-transitively on some graph. A group G acting on a connected graph F = (VT, ET) is said to act distance-transitively if its action on each of the sets {(x, y)\ x, y e VT, d(x, y) = i} is transitive. Here VT and ET stand for the vertices and edges o...
متن کاملOverlapping Self-affine Sets
We study families of possibly overlapping self-affine sets. Our main example is a family that can be considered the self-affine version of Bernoulli convolutions and was studied, in the non-overlapping case, by F. Przytycki and M. Urbański [23]. We extend their results to the overlapping region and also consider some extensions and generalizations.
متن کاملAffine Tallini Sets and Grassmannians
In 1982/1983 A. Bichara and F. Mazzocca characterized the Grassmann space Gr(h,A) of index h of an affine space A of dimension at least 3 over a skew–field K by means of the intersection properties of the three disjoint families of maximal singular subspaces of Gr(h,A) and, till now, their result represents the only known characterization of Gr(h,A). If K is a commutative field and A has finite...
متن کاملAffine Matching of Planar Sets
To recognize an object in an image, we must determine the best-fit transformation which maps an object model into the image data. In this paper, we propose a new alignment approach to recovering those parameters, based on centroid alignment of corresponding feature groups built in the model and data. To derive such groups of features, we exploit a clustering technique that minimizes intraclass ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2003
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-14422